package fr.neyb.bernouilli.problem012;

import fr.neyb.bernouilli.common.math.Factorized;

public class Entry {

	public static void main(String... args) throws Exception {
		int max = 0;
		int i = 0;
		int triNumber = 0;

		while (max < 500) {
			Factorized f = new Factorized((triNumber += ++i));
			int divs = f.getNbDivisors();
			if (divs > max)
				max = divs;
		}

		System.out.println(triNumber + " : " + max + " divisors");
	}
}
